home *** CD-ROM | disk | FTP | other *** search
/ IRIX Base Documentation 2002 November / SGI IRIX Base Documentation 2002 November.iso / usr / share / catman / p_man / catD / hwgraph.edge.z / hwgraph.edge
Encoding:
Text File  |  2002-10-03  |  5.7 KB  |  133 lines
  1.  
  2.  
  3.  
  4. hhhhwwwwggggrrrraaaapppphhhh....eeeeddddggggeeee((((DDDD3333XXXX))))                                            hhhhwwwwggggrrrraaaapppphhhh....eeeeddddggggeeee((((DDDD3333XXXX))))
  5.  
  6.  
  7.  
  8. NNNNAAAAMMMMEEEE
  9.      _hhhh_wwww_gggg_rrrr_aaaa_pppp_hhhh_...._eeee_dddd_gggg_eeee_:::: hwgraph_edge_add, hwgraph_edge_remove, hwgraph_edge_get,
  10.      hwgraph_traverse - operations on hwgraph edges
  11.  
  12. SSSSYYYYNNNNOOOOPPPPSSSSIIIISSSS
  13.      ####iiiinnnncccclllluuuuddddeeee <<<<ssssyyyyssss////ttttyyyyppppeeeessss....hhhh>>>>
  14.      ####iiiinnnncccclllluuuuddddeeee <<<<ssssyyyyssss////hhhhwwwwggggrrrraaaapppphhhh....hhhh>>>>
  15.      ####iiiinnnncccclllluuuuddddeeee <<<<ssssyyyyssss////ddddddddiiii....hhhh>>>>
  16.  
  17.      ggggrrrraaaapppphhhh____eeeerrrrrrrroooorrrr____tttt
  18.      hhhhwwwwggggrrrraaaapppphhhh____eeeeddddggggeeee____aaaadddddddd((((vvvveeeerrrrtttteeeexxxx____hhhhddddllll____tttt _f_r_o_m__v_h_d_l,,,,
  19.                     vvvveeeerrrrtttteeeexxxx____hhhhddddllll____tttt _t_o__v_h_d_l,,,,
  20.                     cccchhhhaaaarrrr ****_e_d_g_e__n_a_m_e))));;;;
  21.  
  22.      ggggrrrraaaapppphhhh____eeeerrrrrrrroooorrrr____tttt
  23.      hhhhwwwwggggrrrraaaapppphhhh____eeeeddddggggeeee____rrrreeeemmmmoooovvvveeee((((vvvveeeerrrrtttteeeexxxx____hhhhddddllll____tttt _f_r_o_m__v_h_d_l,,,,
  24.                     cccchhhhaaaarrrr ****_e_d_g_e__n_a_m_e,,,,
  25.                     vvvveeeerrrrtttteeeexxxx____hhhhddddllll____tttt ****_v_h_d_l__p_t_r))));;;;
  26.  
  27.      ggggrrrraaaapppphhhh____eeeerrrrrrrroooorrrr____tttt
  28.      hhhhwwwwggggrrrraaaapppphhhh____eeeeddddggggeeee____ggggeeeetttt((((vvvveeeerrrrtttteeeexxxx____hhhhddddllll____tttt _f_r_o_m__v_h_d_l,,,,
  29.                     cccchhhhaaaarrrr ****_e_d_g_e__n_a_m_e,,,,
  30.                     vvvveeeerrrrtttteeeexxxx____hhhhddddllll____tttt ****_v_h_d_l__p_t_r))));;;;
  31.  
  32.      ggggrrrraaaapppphhhh____eeeerrrrrrrroooorrrr____tttt
  33.      hhhhwwwwggggrrrraaaapppphhhh____ttttrrrraaaavvvveeeerrrrsssseeee((((vvvveeeerrrrtttteeeexxxx____hhhhddddllll____tttt _f_r_o_m__v_h_d_l,,,,
  34.                     cccchhhhaaaarrrr ****_p_a_t_h,,,,
  35.                     vvvveeeerrrrtttteeeexxxx____hhhhddddllll____tttt ****_v_h_d_l__p_t_r))));;;;
  36.  
  37.    AAAArrrrgggguuuummmmeeeennnnttttssss
  38.      _e_d_g_e__n_a_m_e   Address of a character string containing the label of the new
  39.                  or existing edge originating in _f_r_o_m__v_h_d_l.
  40.  
  41.      _f_r_o_m__v_h_d_l   Vertex handle of an existing vertex, the origin vertex from
  42.                  which a path or edge springs.
  43.  
  44.      _p_a_t_h        Address of a character string describing a sequence of one or
  45.                  more edges separated by slashes, in effect a relative path in
  46.                  /hw.
  47.  
  48.      _t_o__v_h_d_l     Vertex handle of an existing vertex, the destination vertex
  49.                  of a new edge.
  50.  
  51.      _v_h_d_l__p_t_r    Address of a field to receive a vertex handle.
  52.  
  53. DDDDEEEESSSSCCCCRRRRIIIIPPPPTTTTIIIIOOOONNNN
  54.      These functions operate on the hardware graph to add a named edge from
  55.      one vertex to another, to remove a named edge that originates at a
  56.      specified vertex, and to find the destination vertex of a named edge or
  57.      of a list of edges that originates at a specified vertex.
  58.  
  59.  
  60.  
  61.  
  62.  
  63.                                                                         PPPPaaaaggggeeee 1111
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70. hhhhwwwwggggrrrraaaapppphhhh....eeeeddddggggeeee((((DDDD3333XXXX))))                                            hhhhwwwwggggrrrraaaapppphhhh....eeeeddddggggeeee((((DDDD3333XXXX))))
  71.  
  72.  
  73.  
  74.      Typical device drivers do not need to use any of these operations.
  75.      Drivers normally use such functions as _h_w_g_r_a_p_h__b_l_o_c_k__d_e_v_i_c_e__a_d_d() to
  76.      create and connect a new vertex, and normally drivers receive the vertex
  77.      handles they need to query as arguments to their entry points such as
  78.      _a_t_t_a_c_h.
  79.  
  80. DDDDIIIIAAAAGGGGNNNNOOOOSSSSTTTTIIIICCCCSSSS
  81.      All return GRAPH_SUCCESS if the operation completes successfully, or a
  82.      failure code as defined in _h_w_g_r_a_p_h._i_n_t_r_o(D4X) when the operation does not
  83.      complete successfully.
  84.  
  85. SSSSEEEEEEEE AAAALLLLSSSSOOOO
  86.      hwgraph.dev(D3X), hwgraph.intro(D4X).
  87.  
  88.  
  89.  
  90.  
  91.  
  92.  
  93.  
  94.  
  95.  
  96.  
  97.  
  98.  
  99.  
  100.  
  101.  
  102.  
  103.  
  104.  
  105.  
  106.  
  107.  
  108.  
  109.  
  110.  
  111.  
  112.  
  113.  
  114.  
  115.  
  116.  
  117.  
  118.  
  119.  
  120.  
  121.  
  122.  
  123.  
  124.  
  125.  
  126.  
  127.  
  128.  
  129.                                                                         PPPPaaaaggggeeee 2222
  130.  
  131.  
  132.  
  133.